Alternating finite automaton

#	Item
11	Checking Finite Traces using Alternating Automata ∗ Bernd Finkbeiner and Henny Sipma Computer Science Department, Stanford University Stanford, CA[removed]Abstract. Alternating automata have been commonly used as a basi Add to Reading List Source URL: www.verisoft.de Language: English - Date: 2013-04-11 05:48:57 Logic Model theory Theoretical computer science Linear temporal logic Temporal logic Ω-automaton Model checking Interpretation Structure Automata theory Formal languages Mathematics
12	Dependency Tree Automata Colin Stirling School of Informatics Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2009-01-05 09:54:02 Alternating tree automata Nested word Ω-automaton Tree automaton Alternating finite automaton Automata theory Theoretical computer science Computer science